Result Verification Algorithms for Optimization Problems
نویسنده
چکیده
In this article we discuss the design of result verification algorithms for optimization problems. In particular, we design time-optimal result verification algorithms which verify the solution of all-pairs shortest paths, maximum flow, and matching problems. We prove that polynomial-time verification algorithms for AP-complete problems do not exist exist, unless P = NP. Result verification problems for most of the AP-hard problems are not believed to be in NP. We also consider verification algorithms for approximation algorithms for AP-complete and AP-hard problems.
منابع مشابه
An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملVerified Solution of Large Systems and Global Optimization Problems
Recent results on the solution of large, banded or sparse systems and on global unconstrained optimization problems including verification of the correctness of the result will be discussed. The computing time for the verification for large linear systems is the same as for the decomposition, the total computational effort for verifying the global optimum value is for well-known test examples c...
متن کاملOptimization of e-Learning Model Using Fuzzy Genetic Algorithm
E-learning model is examined of three major dimensions. And each dimension has a range of indicators that is effective in optimization and modeling, in many optimization problems in the modeling, target function or constraints may change over time that as a result optimization of these problems can also be changed. If any of these undetermined events be considered in the optimization process, t...
متن کاملDesigning a Meta-Heuristic Algorithm Based on a Simple Seeking Logic
Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...
متن کاملOptimization of e-Learning Model Using Fuzzy Genetic Algorithm
E-learning model is examined of three major dimensions. And each dimension has a range of indicators that is effective in optimization and modeling, in many optimization problems in the modeling, target function or constraints may change over time that as a result optimization of these problems can also be changed. If any of these undetermined events be considered in the optimization process, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017